Causality for Time: How to Specify and Verify Distributed Algorithms
نویسندگان
چکیده
We illustrate a technique for proving properties of distributed programs. Our technique avoids the notion of global time or global state. Furthermore, it does not require any use of temporal logic. All properties are proven using induction on the happened-before relation and its complement. We illustrate our technique by providing a formal proof of Lamport's algorithm for mutual exclusion.
منابع مشابه
Group membership protocol: specification and verification
According to the Evolving Algebra thesis [3], evolving algebras should allow one to specify succinctly any algorithm. There exists substantial evidence con rming this thesis in the case of sequential algorithms (see the annotated bibliography in [3]). In other papers, e.g., [1, 5], evolving algebras are used to specify distributed algorithms. For this paper, we wanted to look at a time-constrai...
متن کاملMechanical Verification of Distributed Algorithms in Higher-Order Logic
The only practical way to verify the correctness of distributed algorithms with a high degree of conndence is to construct machine-checked, formal correctness proofs. In this paper we explain how to do so using HOL|an interactive proof assistant for higher-order logic developed by Gordon and others 18]. First, we describe how to build an infrastructure in HOL that supports reasoning about distr...
متن کاملMechanical Veri cation of Distributed Algorithms in Higher-Order Logic
The only practical way to verify the correctness of distributed algorithms with a high degree of con dence is to construct machine-checked, formal correctness proofs. In this paper we explain how to do so using HOL|an interactive proof assistant for higher-order logic developed by Gordon and others. First, we describe how to build an infrastructure in HOL that supports reasoning about distribut...
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملMathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks
In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994